A Genetic Algorithm for Solving Bicriteria Network Topology Design Problems
نویسندگان
چکیده
منابع مشابه
Bicriteria Network Design Problems
We study several bicriteria network design problems phrased as follows: given an undirected graph and two minimization objectives with a budget specified on one objective, find a subgraph satisfying certain connectivity requirements that minimizes the second objective subject to the budget on the first. First, we develop a formalism for bicriteria problems and their approximations. Secondly, we...
متن کاملMulti-objective hybrid genetic algorithm for bicriteria network design problem
This paper considers the Bicriteria Network Design Problem (bNDP) with the two conflicting objectives of minimizing cost and maximizing flow. Network design problems where even one flow measure be maximized, are often NP-hard problems. But, in real-life applications, it is often the case that the network to be built is required to optimize multi-criteria simultaneously. Thus the calculation of ...
متن کاملWeighted Sum-based Genetic Algorithm for Bicriteria Network Design Problem
This paper proposes a new Multiobjective Genetic Algorithm (MOGA) approach for Bicriteria Network Design (BND) Problem. The objectives are to maximize flow and minimize cost. The proposed method adopts priority-based encoding method to represent a path in the network. Different from other encoding methods, such as path oriented encoding method, priority-based encoding method can be applied for ...
متن کاملWireless sensor network design through genetic algorithm
In this paper, we study WSN design, as a multi-objective optimization problem using GA technique. We study the effects of GA parameters including population size, selection and crossover method and mutation probability on the design. Choosing suitable parameters is a trade-off between different network criteria and characteristics. Type of deployment, effect of network size, radio communication...
متن کاملgenetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 2000
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.12.1_43